connected graph
英 [kəˈnektɪd ɡræf]
美 [kəˈnektɪd ɡræf]
网络 连通图; 连接图; 连通图形; 连结图形
双语例句
- We shall see that a tree can be defined as a connected graph which contains no circuits.
我们将看到树可以定义为一个不包含回路的连通图。 - An articulation point is a vertex of a connected graph which can be split to yield an unconnected graph.
如果一个连通图的一个顶点能被分割，从而使这图成为一个不连通图，则这个顶点称为断点。 - An Approximation Algorithm for Finding the Longest Path in Undirected Connected Graph under Constrains
无向连通图中求约束条件下近似最长路算法 - A tree is a connected graph with no cycles. I could probably get them through inter-library loan.
一个树是一个没有圈的连通图。或许我能通过电脑连线向其他图书馆调借书籍。 - The Zarathustra Project and Reconstruction of Human Moral According to the judging theory of Euler entry ( or circuit) in undirected connected graph, the algorithm and program of computer solution are decided.
查拉图斯特拉工程与道德的本质&论欧洲基因技术与克隆道德根据无向连通图中欧拉通路或欧拉回路的判定定理，给出计算机求解的算法和程序。 - Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph.
本文中引进了连通图的森林图，它是树图的推广。 - G is a minimal connected graph.
G是一个极小连通图。 - An inequality about degree of vertex of a connected graph can be given, and the upper bounds of the largest eigenvalue of the quasi-Laplacian matrix of a connected graph can be obtained.
用代数方法给出了一个关于连通图顶点度数的不等式，并给出了连通图拟拉普拉斯矩阵的最大特征值的几个上界。 - The traditional search algorithm has been improved based on the features of connected graph so that it can calculate operation steps of any specific scheduled task automatically.
针对连接图的这一特点，改进传统的搜索算法，使之可以针对调度任务自动计算操作步骤。 - The Wiener Indices of Connected Graph and Disconnected Graph;
连通图和不连通图的维纳指数W（G） - This article analysises the strongly connexity of accessible matrices, it also gives a new approach to identify strongly connected graph from digraph.
文中用可达矩阵分析了有向图的强连通性，并给出了一种判别有向图为强连通图的新方法。 - Reference [ 3] 、 [ 6] discussed the connected graph with minimum degree distance and the unicyclic graph with minimum degree distance, respectively.
文献[3]和[6]分别给出了具有最小度距离的的连通图以及具有最小度距离的单圈图。 - The theorem on partition of connected graph and its application in graphical enumeration
连通图划分定理及其在图计数中的应用 - The ( Adjacent) Tree Graph of a Connected Graph Is Upper Embeddable
连通图的（邻接）树图的上可嵌入性 - Reachability matrix is an effective tool for identifying whether a directed graph to be strongly or weakly connected graph, it provides the calculating method of reachable matrix with the property of the Boolean matrix operation, the calculation method is easy and simple.
可达矩阵是判别一个有向图是否为强连通图或弱连通图的有效工具.利用布尔矩阵的运算性质给出了计算有向图可达矩阵的方法，该方法计算简便。 - Contractible Edge and Contractible Cycle in k Connected Graph
k-连通图的可收缩边和可收缩圈 - Let G be a simple finite connected graph.
设G是一个有限的简单连通图。 - In this Paper it is Proved by the rank transformation that maximum rank of the adjacent matrixes of all spanning trees of a connected graph G is twice the line independence number of the graph G.
本文中我们用等秩变换证明了连通图G的所有生成树的邻接矩阵的秩中最大者就是图G线独立数的两倍。 - This paper attempts to prove the theorem on the partition of the connected graph.
本文证明了关于连通图划分的一个定理。 - Let G be a finite simple connected graph with a perfect matching.
设G是一个连通的简单图且具有完美匹配。 - Vertices of Degree 6 for Contraction-critical 6-Connected Graph
收缩临界6-连通图中的6度点 - Let G be a 2-edge-connected graph of order n.
设G是2-边-连通的n阶图。 - The Coloring and Edge Number of Minimal n-Edge Connected Graph
极小n棱连通图的着色与棱数 - In this paper, the bond cover of a connected graph was studied.
对连通图的键覆盖进行了研究。 - This article puts forward a method of judging single lateral connected graph and strong connected graph by alternating.
通过对M（D）的变换，给出了判定单侧连通图与强连通图的一种方法。 - By the means of combinatorial matrix, the relation between minimum degree of connected graph and upper bound of spectral radius was carefully depicted. In some conditions, the previous result was improved.
利用组合矩阵方法，精细地刻画出连通图的最小度与谱半径的上界之间的关系，在一定条件下改进了以前的一个结果。 - Method of Value Computing of Sum of Products Formula in the Connected Graph's Relevant Matrix
连通图的关联矩阵的积和式的计值方法 - Using a connected graph to study the underlying topology of an interconnection network has been widely accepted and applied by engineering technicians and computer scientists.
用图研究互联网络的基础拓扑结构已被工程技术人员和计算机科学工作者广泛接受和运用。 - Based on the weighted center concept of connected graph in graph theory, the optimization model of FPSO location has been built, and the best FPSO mooring location has been determined.
基于图论中连通图加权中心的概念，本文建立了FPSO选址优化模型，确定了FPSO的最佳系泊位置。 - By graph theory, an in-depth analysis to node adjacent matrix and the judgment criterion of connected graph is performed.
结合图论知识，深入分析了节点邻接矩阵，提出了图的连通性判定准则。